Edge-connectivity augmentation of graphs over symmetric parity families
نویسنده
چکیده
In this note we solve the edge-connectivity augmentation problem over symmetric parity families. It provides a solution for the minimum T-cut augmentation problem. We also extend a recent result of C. Q. Zhang [8].
منابع مشابه
On the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملSymmetric Matroids and Connectivity Properties of Graphs
A symmetric matroid is a matroid deened on the edge-set of some countably innnite complete graph K in a way that ranks of nite sub-graphs of K are invariant under isomorphism. Thus a symmetric ma-troid M induces on any nite graph G a uniquely determined matroid M(G). We study connectivity properties of circuits and generalized trees of symmetric matroids. We give several characterizations of a ...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملParallel and fast sequential algorithms for undirected edge connectivity augmentation
In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity that increases the edge connectivity of a given undirected graph by τ . It is a known non-trivial property of the edge connectivity augmentation problem that there is a sequence of edge sets E1, E2, . . . , such that ⋃ i≤τ Ei optmially increases the connectivity by τ , for any integer τ . The m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008